public class FindPeakElement {
    public int findPeakElement(int[] nums) {
        int n = nums.length;
        int left = 0, right = n - 1;

        while(left < right) {
            int mid = left + ((right - left) >> 1);
            if(nums[mid] > nums[mid + 1]) {
                right = mid;
            }else {
                left = mid + 1;
            }
        }

        return left;
    }
}
